Maximum-likelihood approximate nearest neighbor method in real-time image recognition
نویسندگان
چکیده
منابع مشابه
Maximum-likelihood approximate nearest neighbor method in real-time image recognition
We explore the problems of classification of composite object (images, speech signals) with low number of models per class. We study the question of improving recognition performance for medium-sized database (thousands of classes). The key issue of fast approximate nearest-neighbor methods widely applied in this task is their heuristic nature. It is possible to strongly prove their efficiency ...
متن کاملFast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph
We introduce a new nearest neighbor search algorithm. The algorithm builds a nearest neighbor graph in an offline phase and when queried with a new point, performs hill-climbing starting from a randomly sampled node of the graph. We provide theoretical guarantees for the accuracy and the computational complexity and empirically show the effectiveness of this algorithm.
متن کاملApproximate Maximum Likelihood Method for Frequency Estimation
A frequency can be estimated by few Discrete Fourier Transform (DFT) coefficients, see Rife and Vincent (1970), Quinn (1994, 1997). This approach is computationally efficient. However, the statistical efficiency of the estimator depends on the location of the frequency. In this paper, we explain this approach from a point of view of an Approximate Maximum Likelihood (AML) method. Then we enhanc...
متن کاملAdaptive approximate nearest neighbor search for fractal image compression
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image subblocks by repeatedly searching a large virtual codebook constructed from the image under compression. One of the most innovative and promising approaches to speed up the encoding is to convert the range-domain block matching problem to a nearest neighbor search pro...
متن کاملEfficient Recognition of Objects by Cascading Approximate Nearest Neighbor Searchers
For object recognition based on nearest neighbor search of local descriptors such as SIFT, it is important to keep the nearest neighbor search efficient to deal with a huge number of descriptors. In this report we propose a new method of efficient recognition based on the observation that the level of accuracy of nearest neighbor search for correct recognition depends on images to be recognized...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 2017
ISSN: 0031-3203
DOI: 10.1016/j.patcog.2016.08.015